Soft linear logic and polynomial time
نویسندگان
چکیده
منابع مشابه
Soft linear logic and polynomial time
We present a subsystem of second order Linear Logic with restricted rules for exponentials so that proofs correspond to polynomial time algorithms, and vice-versa.
متن کاملSoft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont’s Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and complete for polynomial time computations. SLL is the basis for the design of type assignment systems for lambda-calculus, characterizing the complexity classes PTIME, PSPACE and NPTIME. PTIME is characterized by a type assig...
متن کاملSoft Linear Logic and the Polynomial Hierarchy
In this paper we argue that Lafont’s system of Soft Linear Logic [3] is expressive enough to characterize any level of the Polynomial Hierarchy. This characterization is obtained using the existing additive connectives and does not require the introduction of new rules to SLL.
متن کاملOn Elementary Linear Logic and polynomial time
Linear logic (LL) [Gir87] has been used in implicit computational complexity to characterize various complexity classes within the proofs-as-programs approach. This can then be the basis of type systems to guarantee complexity properties on lambda-calculus. As duplication is controlled in LL by the connective ! the key idea of this line of work is to consider variants of this system with a weak...
متن کاملElementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy
Elementary linear logic is a simple variant of linear logic, introduced by Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say computable in time bounded by a tower of exponentials of fixed height. Our goal here is to show that despite its simplicity, elementary linear logic can nevertheless be used as a common framework to charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00523-1